Impossible Differential Cryptanalysis on Feistel Ciphers with SP and SPS Round Functions.

Preliminary study on the law of acupoints applied in moxibustion based on rough set method.

A solution for the data collection in the field survey based on Mobile and Wireless GIS.

Application of ArcGIS Pipeline Data Model and GIS in Digital Oil and Gas Pipeline.

A Quick%2DResponse Real%2DTime Stepping Stone Detection Scheme.

Financial Asset Price Forecasting Based on Intertransaction Association Rules Mining.

A Fast Skip%2DMode Selection Algorithm Based on All%2DZero Block Check in H.264.

The Optimization Implementation of High Performance Video Decoder Based on C6416 DSP.

Visual%2DAudio Integration for User Authentication System of Partner Robots.

Multivariate Laplace transform ratio order with applications.

GPU%2Daccelerated Image Retexturing in Gradient Domain.

Band Structures of Multilayer Films with Randomness.

Efficient Nonnegative Matrix Factorization with Random Projections.

Robust image copy detection using multi%2Dresolution histogram.

Efficient Nonnegative Matrix Factorization with Random Projections.

b%2DBit minwise hashing.

b%2DBit minwise hashing.

Cryptography Based on Spatiotemporal Chaotic Systems.

Development of traditional Chinese medicine clinical data warehouse for medical knowledge discovery and decision support.

Near optimal control for a class of stochastic hybrid systems.


An Empirical Evaluation of Four Algorithms for Multi%2DClass Classification Mart


Fast ABC%2DBoost for Multi%2DClass Classification

Combine multi%2Dvalued attribute decomposition with multi%2Dlabel learning.

Chaotification of Spatiotemporal Systems.

Impact of the Japanese Diagnosis Procedure Combination%2Dbased Payment System in Japan.

Guest editorial special issue on learning theory.

Guest editorial special issue on learning theory.



Detecting Critical Configurations for Dividing Long Image Sequences for Factorization%2DBased 3%2DD Scene Reconstruction.

Pricing Model for Earthquake CAT Bonds.

The Analysis on Angle Noise Produced by Blinking Jamming.

Target Detection in Agriculture Field by Eigenvector Reduction Method of Cem.

Simultaneous Hinfinity stabilization via fixed%2Dorder controllers Equivalence and computation.



An Improved Algorithm Based on EMD%2DWavelet for ECG Signal De%2Dnoising.

A Switching Method Based on FD and WTMM for ECG Signal Real%2DTime Feature Extraction.

Performance Analysis of Public Transport Systems in Nanjing Based on Network Topology.

Network Analysis for Core Herbal Combination Knowledge Discovery from Clinical Chinese Medical Formulae.

On the Role of Problem%2DSolving and Mathematical Modeling in Application%2DOriented Talents Training.

Image%2DBased Material Restyling with Fast Non%2Dlocal Means Filtering.

Fast and robust video copy detection scheme using full DCT coefficients.

ABC%2Dboost adaptive base class boost for multi%2Dclass classification.
We propose abc-boost (adaptive base class boost) for multi-class classification and present abc-mart, an implementation of abcboost, based on the multinomial logit model. The key idea is that, at each boosting iteration, we adaptively and greedily choose a base class. Our experiments on public datasets demonstrate the improvement of abc-mart over the original mart algorithm. 1.

A Globally Convergent Smoothing Method for Symmetric Conic Linear Programming.


Reliable Downloading Algorithms for BitTorrent%2Dlike Systems.

Distinguishing DDoS Attacks from Flash Crowds Using Probability Metrics.

Compressed counting.
The largest cost in servicing virtual memory page faults is the time needed to swap pages to and from backing store. With the increase in portable machines connected to a network across slow wireless links, this cost could become unacceptable. One solution is to use a compression cache, keeping some virtual memory pages in compressed form rather than sending them to the backing store. We have implemented a compression cache similar to previous work with some additional optimizations designed to manage the compressed pages more effectively. We measured page fault and compression counts using a variety of test programs, and applied architecture-specific numbers to determine the effectiveness of a compression cache under many different situations. We also determine the effectiveness of our optimizations. Also measured is the usefulness of virtual memory compression when there is no access to a backing store at all. Results show that a compression cache is useful under a wide variety of po...
Stable Distribution.
This paper concerns the estimation of the parameters that describe a stable distribution. Stable distributions are characterised by four parameters which can be estimated using a number of methods and although approximate maximum likelihood estimation (MLE) techniques do exist, they are computationally intensive. There are a number of techniques that are much faster thanMLE and these are the focus of this paper. These techniques are compared and contrasted both for stable random variables and for teletraffic data. 1 Introduction  A wide range of modelling areas that encompass economics, telecommunications, channel noise modelling and signal interpolation have received treatment with stable distributions (see section 1.4 in [10]). The reasons for this are that the environment to be modelled has tended to be more impulsive than the Gaussian case and the development of more powerful computers has made working with stable processes a more realistic proposition. The lack of closed form expr...
BIBO stabilization of piecewise switched linear systems with delays and nonlinear perturbations.

kth Order convergence for semilinear elliptic boundary value problems.

ABC%2DLogitBoost for Multi%2Dclass Classification

On the Sample Complexity of Compressed Counting

Estimating Entropy of Data Streams Using Compressed Counting

b%2DBit Minwise Hashing

Lexical Organization and Competition in First and Second Languages Computational and Neural Mechanisms.

On positive filtering with H  INFINITY  performance for compartmental networks.

Robust synchronisation of delayed neural networks with both linear and non%2Dlinear couplings.



Building Clinical Data Warehouse for Traditional Chinese Medicine Knowledge Discovery.

Adaptive fuzzy fault%2Dtolerant control for unknown nonlinear systems with disturbances.

Ontology Model%2DBased Static Analysis on Java Programs.

Image Speckle Reduction and Coherence Enhancement in Underwater Ultrasonic Imaging Based on Wavelet Transform.

Research on Pairwise Key Establishment for Cluster Heads in Sensor Networks.

Novel Method of Hybrid Multi%2DAttribute Decision Making.

A Low%2DComplexity Iterative Channel Estimation and Detection Technique for Doubly Selective Channels.

Analysis on Node%27s Pairwise Key Path Construction in Sensor Networks.

An Operational Approach to Validate the Path of BGP.

An electromagnetic energy harvesting circuits for self%2Dpowered wireless sensor network.

An Empirical Study on the Structure of Organizational Learning and Organizational Performance.

Application of blind system identification in acoustic source location.

An electromagnetic energy harvesting circuits for self%2Dpowered wireless sensor network.

Computationally Efficient Estimators for Dimension Reductions UsingStable Random Projections.

A Segment Extraction%2DCombination Algorithm Based on Polygonal Approximation and Finite State Machines for On%2DLine Chinese Character Recognition.

Multi%2Dlabel Classification based on Association Rules with Application to Scene Classification.

An Evaluation Index Based on Parameter Weight for Image Inpainting Quality.

One sketch for all Theory and Application of Conditional Random Sampling.
Conditional Random Sampling (CRS) was originally proposed for efficiently computing pairwise (l2, l1) distances, in static, large-scale, and sparse data. This study modifies the original CRS and extends CRS to handle dynamic or streaming data, which much better reflect the real-world situation than assuming static data. Compared with many other sketching algorithms for dimension reductions such as stable random projections, CRS exhibits a significant advantage in that it is “one-sketch-for-all. ” In particular, we demonstrate the effectiveness of CRS in efficiently computing the Hamming norm, the Hamming distance, the lp distance, and the χ 2 distance. A generic estimator and an approximate variance formula are also provided, for approximating any type of distances. We recommend CRS as a promising tool for building highly scalable systems, in machine learning, data mining, recommender systems, and information retrieval. 1
The Polarization Suppression Method of the Local Radar Disturbances in Polarized Receiving.


Research on Polarization Parameter Extraction in Radar Reconnaissance.

Estimators and tail bounds for dimension reduction in l%26alpha%3B %280 %26lt%3B %26alpha%3B %26le%3B 2%29 using stable random projections.

BIBO stabilization of time%2Ddelayed system with nonlinear perturbation.


On Approximating Frequency Moments of Data Streams with Skewed Projections

Compressed Counting
The largest cost in servicing virtual memory page faults is the time needed to swap pages to and from backing store. With the increase in portable machines connected to a network across slow wireless links, this cost could become unacceptable. One solution is to use a compression cache, keeping some virtual memory pages in compressed form rather than sending them to the backing store. We have implemented a compression cache similar to previous work with some additional optimizations designed to manage the compressed pages more effectively. We measured page fault and compression counts using a variety of test programs, and applied architecture-specific numbers to determine the effectiveness of a compression cache under many different situations. We also determine the effectiveness of our optimizations. Also measured is the usefulness of virtual memory compression when there is no access to a backing store at all. Results show that a compression cache is useful under a wide variety of po...
Computationally Efficient Estimators for Dimension Reductions Using Stable Random Projections

On Approximating the Lp Distances for pg%3B2

The Optimal Quantile Estimator for Compressed Counting

A Very Efficient Scheme for Estimating Entropy of Data Streams Using Compressed Counting

Adaptive Base Class Boost for Multi%2Dclass Classification
We propose abc-boost (adaptive base class boost) for multi-class classification and present abc-mart, an implementation of abcboost, based on the multinomial logit model. The key idea is that, at each boosting iteration, we adaptively and greedily choose a base class. Our experiments on public datasets demonstrate the improvement of abc-mart over the original mart algorithm. 1.
Hamilton cycles in circuit graphs of matroids.


State of the Art in Vehicle Active Suspension Adaptive Control Systems Based on Intelligent Methodologies.


Paths in circuit graphs of matroids.

Analysis of the H.264 advanced video coding standard and an associated rate control scheme.

Cost%2DEffectiveness of Implantable Cardioverter%2DDefibrillators in Brugada Syndrome Treatment.

Paths in circuit graphs of matroids.

Model%2DBased Reasoning in Science%2C Technology%2C and Medicine

Texture%2DIndependent Feature%2DPoint Matching %28TIFM%29 from Motion Coherence.
Abstract. This paper proposes a novel and efficient feature-point matching algorithm for finding point correspondences between two uncalibrated images. The striking feature of the proposed algorithm is that the algorithm is based on the motion coherence/smoothness constraint only, which states that neighboring features in an image tend to move coherently. In the algorithm, the correspondences of feature points in a neighborhood are collectively determined in a way such that the smoothness of the local motion field is maximized. The smoothness constraint does not rely on any image feature, and is self-contained in the motion field. It is robust to the camera motion, scene structure, illumination, etc. This makes the proposed algorithm texture-independent and robust. Experimental results show that the proposed method outperforms existing methods for feature-point tracking in image sequences. 1

Descriptor%2DFree Smooth Feature%2DPoint Matching for Images Separated by Small%2FMid Baselines.

Nonlinear Estimators and Tail Bounds for Dimension Reduction in l 1 Using Cauchy Random Projections.
For1 dimension reduction in the l1 norm, the method of Cauchy random projections multiplies the original data matrix A ∈ Rn×D with a random matrix R ∈ RD×k (k ≪ D) whose entries are i.i.d. samples of the standard Cauchy C(0,1). Because of the impossibility result, one can not hope to recover the pairwise l1 distances in A from B = A × R ∈ Rn×k, using linear estimators without incurring large errors. However, nonlinear estimators are still useful for certain applications in data stream computations, information retrieval, learning, and data mining. We study three types of nonlinear estimators: the sample median estimators, the geometric mean estimators, and the maximum likelihood estimators � (MLE). We derive tail bounds for the logn geometric mean estimators and establish that k = O ε2 � suffices with the constants explicitly given. Asymptotically (as k → ∞), both the sample median and the geometric mean estimators are about 80 % efficient compared to the MLE. We analyze the moments of the MLE and propose approximating its distribution of by an inverse Gaussian. Keywords: dimension reduction, l1 norm, Johnson-Lindenstrauss (JL) lemma, Cauchy random projections
A Segmentation Transmission Approach and Information System for Agriculture Information Based on Mobile Communication.


A Conceptual Structure for Organizational Learning and Organizational Performance.

Contrast%2DInvariant Feature Point Correspondence.

An Angle%2DBased Crossover Tabu Search for Vehicle Routing Problem.

Global Synchronization in an Array of Delayed Neural Networks with Nonlinear Coupling.

The Edge Connectivity of Circuit Graphs of Matroids.

Very sparse stable random projections for dimension reduction in lalpha %280 %26lt%3Balphal%3B%3D2%29 norm.

Novel Data Management Algorithms in Peer%2Dto%2DPeer Content Distribution Networks.

A Unified Near%2DOptimal Estimator For Dimension Reduction in lalpha%280 l%3B alpa %26lt%3B%3D 2%29 Using Stable Randm Pojectios.

McRank Learning to Rank Using Multiple Classification and Gradient Boosting.
We cast the ranking problem as (1) multiple classification (“Mc”) (2) multiple ordinal classification, which lead to computationally tractable learning algorithms for relevance ranking in Web search. We consider the DCG criterion (discounted cumulative gain), a standard quality measure in information retrieval. Our approach is motivated by the fact that perfect classifications result in perfect DCG scores and the DCG errors are bounded by classification errors. We propose using the Expected Relevance to convert class probabilities into ranking scores. The class probabilities are learned using a gradient boosting tree algorithm. Evaluations on large-scale datasets show that our approach can improve LambdaRank [5] and the regressions-based ranker [6], in terms of the (normalized) DCG scores. An efficient implementation of the boosting tree algorithm is also presented. 1
Performance Analysis of Cellular System Enhanced with Two%2DHop Fixed Relay Nodes.

Securing Communication by Chaos%2Dbased Encryption.

A Chip Performing Chaotic Stream Encryption.

A Chip Performing Chaotic Stream Encryption.

Application of Chaos%2Dbased Pseudo%2DRandom%2DBit Generators in Internet%2Dbased Online Payments.

Dynamic Self%2DOrganization and Early Lexical Development in Children.

A Sketch Algorithm for Estimating Two%2DWay and Multi%2DWay Associations.
We should not have to look at the entire corpus (e.g., the Web) to know if two (or more) words are strongly associated or not. One can often obtain estimates of associations from a small sample. We develop a sketch-based algorithm that constructs a contingency table for a sample. One can estimate the contingency table for the entire population using straightforward scaling. However, one can do better by taking advantage of the margins (also known as document frequencies). The proposed method cuts the errors roughly in half over Broder’s sketches. 1.
A practical approach to testing GUI systems.

Cycles in Circuit Graphs of Matroids.

Spectrum Partitioning and Relay Positioning for Cellular System Enhanced with Two%2DHop Fixed Relay Nodes.

A Dynamic Mobile Terminal Sleep Mode Operation Scheme Considering Packet Queue Length.

A Direction%2DDependent Mobile Terminal Sleep Mode Operation Scheme.

A new algorithm based on copulas for VaR valuation with empirical calculations.

Improving Random Projections Using Marginal Information.
We present an improved version of random projections that takes advantage  of marginal norms. Using a maximum likelihood estimator (MLE), marginconstrained  random projections can improve estimation accuracy considerably.
The Algorithm For Berth Scheduling Problem By The Hybrid Optimization Strategy GASA.

Optimal Identification and Estimation in Practical Noisy Environments.

Unbiased Adaptive Time%2Ddelay Estimation in Noisy Environments.

Adaptive Kernel Leaning Networks with Application to Nonlinear System Identification.

Intelligent Rotor Speed Controller for a Mini Autonomous Helicopter.

Fuzzy Support Vector Clustering.

Grid%2DBased Fuzzy Support Vector Data Description.

Synchronization of a Class of Coupled Discrete Recurrent Neural Networks with Time Delay.

Very sparse random projections.
There has been considerable interest in random projections, an approximate algorithm for estimating distances between pairs of points in a high-dimensional vector space. Let      be our n points in D dimensions. The method multiplies A by a random matrix R     , reducing the  D dimensions down to just k for speeding up the computation.  R typically consists of entries of standard normal  N(0, 1). It is well known that random projections preserve pairwise distances (in the expectation). Achlioptas proposed  sparse random projections by replacing the N(0, 1) entries in R with entries in     6 ,  3 ,   },  achieving a threefold speedup in processing time. We recommend using R of entries in       , 1-   # D     for achieving a significant # D-  fold speedup, with little loss in accuracy.
Conditional Random Sampling A Sketch%2Dbased Sampling Technique for Sparse Data.
We 1 develop Conditional Random Sampling (CRS), a technique particularly suitable for sparse data. In large-scale applications, the data are often highly sparse. CRS combines sketching and sampling in that it converts sketches of the data into conditional random samples online in the estimation stage, with the sample size determined retrospectively. This paper focuses on approximating pairwise l2 and l1 distances and comparing CRS with random projections. For boolean (0/1) data, CRS is provably better than random projections. We show using real-world data that CRS often outperforms random projections. This technique can be applied in learning, data mining, information retrieval, and database query optimizations. 1
Reuse Partitioning Based Frequency Planning for Cellular Network with two%2DHOP Fixed Relay Nodes.

A Further Approach on Hypercube%2DBased Pairwise Key Establishment in Sensor Networks.

Reuse Partitioning Based Frequency Planning for Relay Enhanced Cellular System with NLOS BS%2DRelay Links.

Radio Resource Allocation in Two%2Dhop Cellular Relaying Network.

On Portfolio%27s Default%2DRisk%2DAdjusted Duration and Value Model and Algorithm Based on Copulas.

Nonlinear Estimators and Tail Bounds for Dimension Reduction in %24l%5F1%24 Using Cauchy Random Projections
For1 dimension reduction in the l1 norm, the method of Cauchy random projections multiplies the original data matrix A ∈ Rn×D with a random matrix R ∈ RD×k (k ≪ D) whose entries are i.i.d. samples of the standard Cauchy C(0,1). Because of the impossibility result, one can not hope to recover the pairwise l1 distances in A from B = A × R ∈ Rn×k, using linear estimators without incurring large errors. However, nonlinear estimators are still useful for certain applications in data stream computations, information retrieval, learning, and data mining. We study three types of nonlinear estimators: the sample median estimators, the geometric mean estimators, and the maximum likelihood estimators � (MLE). We derive tail bounds for the logn geometric mean estimators and establish that k = O ε2 � suffices with the constants explicitly given. Asymptotically (as k → ∞), both the sample median and the geometric mean estimators are about 80 % efficient compared to the MLE. We analyze the moments of the MLE and propose approximating its distribution of by an inverse Gaussian. Keywords: dimension reduction, l1 norm, Johnson-Lindenstrauss (JL) lemma, Cauchy random projections
Very Sparse Stable Random Projections

Analysis of a Multiple%2DOutput Pseudo%2DRandom%2DBit Generator Based on a Spatiotemporal Chaotic System.

On the distribution of SINR for the MMSE MIMO receiver and performance analysis.
Abstract — This paper studies the statistical distribution of the signal-to-interference-plus-noise ratio (SINR) for the minimum mean square error (MMSE) receiver in multiple-input-multipleoutput (MIMO) wireless communications. The channel model is assumed to be (transmit) correlated Rayleigh flat-fading with unequal powers. The SINR can be decomposed into two independent random variables: SINR = SINR ZF + T, where SINR ZF corresponds to the SINR for a zero-forcing (ZF) receiver and has an exact Gamma distribution. This paper focuses on characterizing the statistical properties of T using the results from random matrix theory. First three asymptotic moments of T are derived for uncorrelated channels and channels with equicorrelations. For general correlated channels, some limiting upperbounds for the first three moments are also provided. For uncorrelated channels and correlated channels satisfying certain conditions, it is proved that T converges to a Normal random variable. A Gamma distribution and a generalized Gamma distribution are proposed as approximations to the finite sample distribution of T. Simulations suggest that these approximate distributions can be used to accurately estimate the probability of errors even for very small dimensions (e.g., 2 transmit antennas). Index Terms — Multiple-input-multiple-output system, minimum mean square error receiver, signal-to-interference-plusnoise ratio, channel correlation, random matrix, asymptotic distributions, Gamma approximation, error probability. I.
The relationships among several types of fuzzy automata.

Algebraic properties of LA%2Dlanguages.

On Default Correlation and Pricing of Collateralized Debt Obligation by Copula Functions.

Mental Representation of Verb Meaning Behavioral and Electrophysiological Evidence.

Stability in static delayed neural networks A nonlinear measure approach.

Application of genetic algorithm in estimating origin%2Ddestination matrices of traffic network.

Using Sketches to Estimate Associations.
We should not have to look at the entire corpus (e.g., the Web) to know if two words are associated or not. 1 A powerful sampling technique called Sketches was originally introduced to remove duplicate Web pages. We generalize sketches to estimate contingency tables and associations, using a maximum likelihood estimator to find the most likely contingency table given the sample, the margins (document frequencies) and the size of the collection. Not unsurprisingly, computational work and statistical accuracy (variance or errors) depend on sampling rate, as will be shown both theoretically and empirically. Sampling methods become more and more important with larger and larger collections. At Web scale, sampling rates as low as 10 −4 may suffice. 1
RSA Extended Modulus Attacks and Their Solutions in a Kind of Fair Exchange Protocols.

Curve%2DBased Greedy Routing Algorithm for Sensor Networks.

Electronic markets and electronic hierarchies in the context of electronic commerce.

Soft Sensor Modeling Based on DICA%2DSVR.

Using Rough Set to Reduce SVM Classifier Complexity and Its Use in SARS Data Set.

A New Algorithm Based on Copulas for Financial Risk Calculation with Applications to Chinese Stock Markets.

Design and implementation of parallel video encoding strategies using divisible load analysis.
Abstract—The processing time needed for motion estimation usually accounts for a significant part of the overall processing time of the video encoder. To improve the video encoding speed, reducing the execution time for motion estimation process is essential. Parallel implementation of video encoding systems using either the software or the hardware approach has attracted much attention in the area of real time video coding. In this paper, we attempt to implement a video encoder on a bus network. Usually, for such a parallel system, the key concern is associated with partitioning and balancing of the computational load among the processors such that the overall processing time of the video encoder is minimized. With the use of the divisible load theory (DLT) paradigm, a strip-wise load partitioning/balancing scheme, a load distribution strategy, two implementation strategies are developed to exploit the data parallelism inherent in the video encoding process. The striking feature of our design is that,both the granularity of the load partitions and all the associated overheads caused during parallel video encoding process can be explicitly considered. This significantly contributes to the minimization of the overall processing time of the video encoder. Extensive experimental studies are carried out to test the effectiveness of the proposed strategies. The performance of the parallel video encoder is quantified using the metrics speedup and performance gain, respectively. The experimental results show that our strategies are effective for exploiting the available parallelism inherent in the video encoding process and provide a theoretical insight on how to analytically quantify and minimize the overall processing time of a parallel system. The proposed strategies can be easily extended and applied to improve other existing parallel systems. Index Terms—Block matching motion estimation, bus network, divisible load theory (DLT), load distribution, load partitioning/balancing, parallel video coding. I.
Parameter estimation for Choquet fuzzy integral based on Takagi%2DSugeno fuzzy model.

Double proton transfer and one%2Delectron oxidation behavior in double H%2Dbonded glycinamide%2Dglycine complex in the gas phase.

Cognitive task analysis A cognitive approach to evaluate evidence%2Dbased nursing websites.

Joint Task Placement

Robust and Adaptive Dynamic Power Management for Time Varying System.

An iterative method for hypothetical reference decoder.

Feedback%2DAssisted Iterative Learning Control for Batch Polymerization Reactor.

Adaptive Leak Detection and Location in Underground Buried Pipelines.

Characterizations of Dissipation Factors in Piezoelectric ceramic Discs under Stress and temperature.

Early lexical development in a self%2Dorganizing neural network.

Optimizing Fuzzy Decision Trees Using Genetic Algorithms.

Modeling the Development of Lexicon with a Growing Self%2DOrganizing Map.
We present a self-organizing neural network model that can acquire an incremental lexicon. The model allows the acquisition of new words without disrupting learned structure. The model consists of three major components. First, the word co-occurrence detector computes word transition probabilities and represents word meanings in terms of context vectors. Second, word representations are projected to a lower, constant dimension. Third, the growing lexical map (GLM) self-organizes on the dimension-reduced word representations. The model is initialized with a subset of units in GLM and a subset of the lexicon, which enables it to capture the regularities of the input space and decrease chances of catastrophic interference. During growth, new nodes are inserted in order to reduce the map quantization error, and the insertion occurs only to yet unoccupied grid positions, thus preserving the 2D map topology. We have tested GLM on a portion of parental speech extracted from the CHILDES database, with an initial 200 words scattered among 800 nodes. The model demonstrates the ability to highly preserve learned lexical structure when 100 new words are gradually added. Implications of the model are discussed with respect to language acquisition by children.
Particle filtering based likelihood ratio approach to fault diagnosis in nonlinear stochastic systems.

An Arbitrarily Distributed Tactile%2DSensor Array Based on a Piezoelectric Resonator.

Predicting the Entropy of Boiling for Organic Compounds.

Classification of 13 Types of New Zealand Pollen Patterns Using Neural Networks.

Cryptotype
This study explores the self-organizing neural network as a model of lexical and morphological acquisition. We examined issues of generalization, representation, and recovery in a multiple feature-map model as implemented in DISLEX (Miikkulainen, 1997). Our results indicate that self-organization and Hebbian learning are two important computational principles that can account for the psycholinguistic processes of semantic representation, morphological generalization, and recovery from generalizations in the acquisition of reversive prefixes such as un- and dis-. These results attest to the utility of self-organizing neural networks in the study of language acquisition.  Introduction  Language learning is characterized by the learner&#039;s ability to generalize beyond what is heard in the input. One current debate on connectionist models of language acquisition concerns the issue of generalization (Elman, 1998). Probably the best-known example in this debate has to do with the acquisition o...
